Efficient Algorithm for Computing Einstein Integrals
نویسندگان
چکیده
Analytical approximations to Einstein integrals are proposed. The approximations represented by two fast-converging series are valid for all values of their arguments. Accordingly, the algorithm can be easily incorporated into professional software like HEC-RAS or HEC-6 with minimum computational effort. DOI: 10.1061/(ASCE)0733-9429(2004)130:12(1198) CE Database subject headings: Bed load; Suspended load; Sediment transport; Computation; Algorithms.
منابع مشابه
An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملA General New Algorithm for Regulaization of Singular Integrals in Three-Dimensional Boundary Elemnts
In this paper an algorithm is presented for the regularization of singular integrals with any degrees of singularity, which may be employed in all three-dimensional problems analyzed by Boundary Elements. The integrals in Boundary Integrals Equations are inherently singular. For example, one can mention the integrals confronted in potential problems to evaluate the flow or the gradient of the f...
متن کاملA General New Algorithm for Regulaization of Singular Integrals in Three-Dimensional Boundary Elemnts
In this paper an algorithm is presented for the regularization of singular integrals with any degrees of singularity, which may be employed in all three-dimensional problems analyzed by Boundary Elements. The integrals in Boundary Integrals Equations are inherently singular. For example, one can mention the integrals confronted in potential problems to evaluate the flow or the gradient of the f...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کامل